Global Optimization Using Space Filling Curves
نویسندگان
چکیده
منابع مشابه
Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants
In this paper, the global optimization problem miny∈S F (y) with S being a hyperinterval in R and F (y) satisfying the Lipschitz condition with an unknown Lipschitz constant is considered. It is supposed that the function F (y) can be multiextremal, non-differentiable, and given as a ‘black-box’. To attack the problem, a new global optimization algorithm based on the following two ideas is prop...
متن کاملUsing Space-filling Curves for Computation Reordering
Space-filling curves have been widely used in mathematics and to transform multi-dimensional problems into one-dimensional forms. For scientific applications, ordering data or computation along spacefilling curves can be useful for exploiting locality when partitioning onto parallel systems or when restructuring to exploit memory hierarchy. In this paper, we present an efficient approach for en...
متن کاملDynamic Load Balancing Using Space-Filling Curves
Space-filling curves (SFCs) provide a continuous mapping from a one-dimensional to a d-dimensional space and have been used to linearize spatially distributed data for partitioning, memory management and image processing. This paper gives a short introduction to the concept of SFCs and highlights some of the applications found in computer science. The main focus will be on dynamic distribution ...
متن کاملUnconventional Space-filling Curves
A 2-dimensional space-filling curve, here, is a surjective continuous map from an interval to a 2-dimensional space. To construct a new space-filling curve distinct and much different from Hilbert’s, Peano’s, and the Z-order, we first observe that all three of these curves are based on self-similar fractals–in particular, the recursive definition of the sequences of functions that converge to t...
متن کاملSynthesis of Space-Filling Curves Through Measure- Preserving Transformations and Their Application to Global Optimization
This paper proposes a new multi-start, stochastic global optimization algorithm that uses dimensional reduction techniques based upon approximations of space-filling curves and simulated annealing, aiming to find global minima of real-valued (possibly multimodal) functions that are not necessarily well behaved, that is, are not required to be differentiable, continuous, or even satisfying Lipsc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Electrical and Electronic Engineering
سال: 2017
ISSN: 1804-3119,1336-1376
DOI: 10.15598/aeee.v15i2.2303